Pickup and Delivery Problem of Automobile Outbound Logistics Considering Trans-Shipment among Distribution Centers

This paper considers a pickup and delivery problem in automobile logistics. In the daily operations of third-party logistics company (3PL), decisions must be made for two kinds demands: delivering finished automobiles from an outbound warehouse to distribution centers (DCs) transferring among DCs according specific customer orders. The is assign set heterogeneous auto-carriers deliver them their destinations considering transfer demands. Each assigned value indicating its urgency level handled car type: small, medium, or large. has number slots with different types largest size that can loaded into slot. An integer programming (IP) model formulated maximize total minimize transportation cost depending on routing carriers. improved adaptive large neighborhood search algorithm developed solve efficiently, where heuristic generates initial solution, series operators update solution iteratively. Experimental results based multi-scale instances show proposed generate near-optimal solutions acceptable amount time, outperforms solving IP directly by CPLEX extent. help 3PL companies make efficient economical operations.